A New Block-Diagonal Preconditioner for a Class of $$3\times 3$$ Block Saddle Point Problems

نویسندگان

چکیده

We study the performance of a new block preconditioner for class \(3\times 3\) saddle point problems which arise from finite-element methods solving time-dependent Maxwell equations and some other practical problems. also estimate lower upper bounds eigenvalues preconditioned matrix. Finally, we examine our to accelerate convergence speed GMRES method shows effectiveness preconditioner.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal Block Diagonal Preconditioner for Heterogeneous Saddle Point Problems in Phase Separation

The phase separation processes are typically modeled by Cahn-Hilliard equations. This equation was originally introduced to model phase separation in binary alloys; where phase stands for concentration of different components in alloy. When the binary alloy under preparation is subjected to a rapid reduction in temperature below a critical temperature, it has been experimentally observed that t...

متن کامل

An Algebraic Analysis of a Block Diagonal Preconditioner for Saddle Point Systems

We consider a positive definite block preconditioner for solving saddle point linear systems. An approach based on augmenting the (1,1) block while keeping its condition number small is described, and algebraic analysis is performed. Ways of selecting the parameters involved are discussed, and analytical and numerical observations are given.

متن کامل

A New Analysis of Block Preconditioners for Saddle Point Problems

We consider symmetric saddle point matrices. We analyze block preconditioners based on the knowledge of a good approximation for both the top left block and the Schur complement resulting from its elimination. We obtain bounds on the eigenvalues of the preconditioned matrix that depend only of the quality of these approximations, as measured by the related condition numbers. Our analysis applie...

متن کامل

On block diagonal and block triangular iterative schemes and preconditioners for stabilized saddle point problems

We review the use of block diagonal and block lower/upper triangular splittings for constructing iterative methods and preconditioners for solving stabilized saddle point problems. We introduce new variants of these splittings and obtain new results on the convergence of the associated stationary iterations and new bounds on the eigenvalues of the corresponding preconditioned matrices. We furth...

متن کامل

A BDDC Preconditioner for Saddle Point Problems

The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are defined in terms of a set of primal continuity constraints, which are enforced across the interface between the subdomains, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mediterranean Journal of Mathematics

سال: 2022

ISSN: ['1660-5454', '1660-5446']

DOI: https://doi.org/10.1007/s00009-021-01973-5